package 左哥算法.ch03堆;

import java.util.Map;

/**
 * 固定大小的动态优先级队列。用于解决动态 topK问题
 */
public class FixedActivityHeap<T>{
    int k;
    T[] nodes;
    Map<T,Integer> indexMap;
    Map<T,Integer> countMap;
    public FixedActivityHeap(int k) {
        this.k = k;
        this.nodes= (T[]) new Object[k];
    }
    public void add(T node){

    }
//    public T

    public static void main(String[] args) {
        FixedActivityHeap<String> heap = new FixedActivityHeap<>(10);

    }
}
